<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>GrPPI: divideconquer.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="logo.svg"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">GrPPI
   &#160;<span id="projectnumber">0.2</span>
   </div>
   <div id="projectbrief">Generic and Reusable Parallel Pattern Interface</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_3a90233651aeb6de4309a51b31e57ac6.html">omp</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">omp/divideconquer.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="omp_2divideconquer_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#ifndef GRPPI_OMP_DIVIDECONQUER_H</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#define GRPPI_OMP_DIVIDECONQUER_H</span></div><div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;</div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#ifdef GRPPI_OMP</span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;</div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="parallel__execution__omp_8h.html">parallel_execution_omp.h</a>&quot;</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;</div><div class="line"><a name="l00028"></a><span class="lineno">   28</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespacegrppi.html">grppi</a> {</div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Input, <span class="keyword">typename</span> Div<span class="keywordtype">id</span>er, <span class="keyword">typename</span> Solver, <span class="keyword">typename</span> Combiner&gt;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">typename</span> std::result_of&lt;Solver(Input)&gt;::type </div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="namespacegrppi.html#a32d36dbd6375927e3b67a37a9f08c31d">   32</a></span>&#160;<a class="code" href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">internal_divide_conquer</a>(<a class="code" href="classgrppi_1_1parallel__execution__omp.html">parallel_execution_omp</a> &amp; ex, </div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;                            Input &amp; input, </div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;                            Divider &amp;&amp; divide_op, Solver &amp;&amp; solve_op, </div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;                            Combiner &amp;&amp; combine_op, </div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;                            std::atomic&lt;int&gt; &amp; num_threads) </div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;{</div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;  <span class="comment">// Sequential execution fo internal implementation</span></div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;  <span class="keyword">using</span>  Output = <span class="keyword">typename</span> std::result_of&lt;Solver(Input)&gt;::type;</div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;  <a class="code" href="classgrppi_1_1sequential__execution.html">sequential_execution</a> seq;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;  Output out;</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;  <span class="keywordflow">if</span>(num_threads.load()&gt;0) {</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <span class="keyword">auto</span> subproblems = divide_op(input);</div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="keywordflow">if</span>(subproblems.size()&gt;1) {</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;      std::vector&lt;Output&gt; partials(subproblems.size()-1);</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;      <span class="keywordtype">int</span> division = 0;</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;      <span class="keyword">auto</span> i = subproblems.begin()+1;</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;      <span class="keywordflow">for</span>(i; i!=subproblems.end() &amp;&amp; num_threads.load()&gt;0; i++, division++){</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;        <span class="comment">//THREAD</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="preprocessor">        #pragma omp task firstprivate(i, division) shared(divide_op, solve_op, \</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="preprocessor">                combine_op, partials, num_threads)</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;        {</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;          partials[division] = <a class="code" href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">internal_divide_conquer</a>(ex, *i, </div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;              std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;              std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;              std::forward&lt;Combiner&gt;(combine_op), num_threads);</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;         <span class="comment">//END TRHEAD</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;         }</div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;         num_threads --;</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;             </div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;      }</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;      <span class="keywordflow">for</span>(i; i != subproblems.end(); i++){</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        partials[division] = <a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(seq, *i, </div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;            std::forward&lt;Combiner&gt;(combine_op));</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;      }</div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;          </div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;      <span class="comment">//Main thread works on the first subproblem.</span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;      out = <a class="code" href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">internal_divide_conquer</a>(ex, *subproblems.begin(), </div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;          std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;          std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;          std::forward&lt;Combiner&gt;(combine_op), num_threads);</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;<span class="preprocessor">      #pragma omp taskwait</span></div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;      <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i&lt;partials.size();i++){ </div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        out = combine_op(out,partials[i]);</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;      }</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    }</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;      out = solve_op(input);</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    }</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;  }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(seq, input, std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        std::forward&lt;Solver&gt;(solve_op), std::forward&lt;Combiner&gt;(combine_op));</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;  }</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;}</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> Input, <span class="keyword">typename</span> Div<span class="keywordtype">id</span>er, <span class="keyword">typename</span> Solver, <span class="keyword">typename</span> Combiner&gt;</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="keyword">typename</span> std::result_of&lt;Solver(Input)&gt;::type </div><div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="group__divide__conquer__pattern__omp.html#ga9e3a20eb0dccd5aacb71cee102101e16">  117</a></span>&#160;<a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(<a class="code" href="classgrppi_1_1parallel__execution__omp.html">parallel_execution_omp</a> &amp; ex, </div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;                   Input &amp; input, </div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                   Divider &amp;&amp; divide_op, Solver &amp;&amp; solve_op, </div><div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;                   Combiner &amp;&amp; combine_op) </div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;{</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;  std::atomic&lt;int&gt; num_threads{ex.<a class="code" href="classgrppi_1_1parallel__execution__omp.html#ac46ceef1db7f46cc7c93a2e1f4a43f08">concurrency_degree</a>()-1};</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;  <a class="code" href="classgrppi_1_1sequential__execution.html">sequential_execution</a> seq;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;  <span class="keyword">using</span> Output = <span class="keyword">typename</span> std::result_of&lt;Solver(Input)&gt;::type;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;  <span class="keywordflow">if</span> (num_threads.load()&lt;=0) {</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(seq, input, </div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;        std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;        std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;        std::forward&lt;Combiner&gt;(combine_op));</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;  }</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;  <span class="keyword">auto</span> subproblems = divide_op(input);</div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;  <span class="keywordflow">if</span> (subproblems.size()&lt;=1) {</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    <span class="keywordflow">return</span> solve_op(input);</div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;  }</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;  std::vector&lt;Output&gt; partials(subproblems.size()-1);</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;  <span class="keywordtype">int</span> division = 0;</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;  </div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;  Output out;</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;<span class="preprocessor">  #pragma omp parallel</span></div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;  {</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;<span class="preprocessor">    #pragma omp single nowait</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    { </div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;      <span class="keyword">auto</span> i = subproblems.begin() + 1;</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;      <span class="keywordflow">for</span> (i; i!=subproblems.end() &amp;&amp; num_threads.load()&gt;0; i++, division++) {</div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;        <span class="comment">//THREAD</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="preprocessor">        #pragma omp task firstprivate(i,division) \</span></div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="preprocessor">                shared(partials,divide_op,solve_op,combine_op,num_threads)</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;        {</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;          partials[division] = <a class="code" href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">internal_divide_conquer</a>(ex, *i,</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;              std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;              std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;              std::forward&lt;Combiner&gt;(combine_op), num_threads);</div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;          <span class="comment">//END TRHEAD</span></div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;        }</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        num_threads --;</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;      }</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;      <span class="keywordflow">for</span> (i; i!=subproblems.end(); i++) {</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;        partials[division] = <a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(seq, *i, </div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            std::forward&lt;Combiner&gt;(combine_op));</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;      }</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;      <span class="comment">//Main thread works on the first subproblem.</span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;      <span class="keywordflow">if</span> (num_threads.load()&gt;0) {</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;        out = <a class="code" href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">internal_divide_conquer</a>(ex, *subproblems.begin(),</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;            std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;            std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;            std::forward&lt;Combiner&gt;(combine_op), num_threads);</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;      }</div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;      <span class="keywordflow">else</span> {</div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;        out = <a class="code" href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">divide_conquer</a>(seq, *subproblems.begin(),</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;            std::forward&lt;Divider&gt;(divide_op), </div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;            std::forward&lt;Solver&gt;(solve_op), </div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;            std::forward&lt;Combiner&gt;(combine_op));</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;      }</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;<span class="preprocessor">      #pragma omp taskwait</span></div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    }</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;  }</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;  <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;&amp; p : partials) { out = combine_op(out,p); }</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;}</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;}</div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;</div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;<span class="preprocessor">#endif</span></div><div class="ttc" id="namespacegrppi_html"><div class="ttname"><a href="namespacegrppi.html">grppi</a></div><div class="ttdef"><b>Definition:</b> callable_traits.h:24</div></div>
<div class="ttc" id="group__divide__conquer__pattern__native_html_ga1fb7f707091b7f3a2c7df220f99760d2"><div class="ttname"><a href="group__divide__conquer__pattern__native.html#ga1fb7f707091b7f3a2c7df220f99760d2">grppi::divide_conquer</a></div><div class="ttdeci">std::result_of&lt; Solver(Input)&gt;::type divide_conquer(parallel_execution_native &amp;ex, Input &amp;problem, Divider &amp;&amp;divide_op, Solver &amp;&amp;solve_op, Combiner &amp;&amp;combine_op)</div><div class="ttdoc">Invoke Divide/conquer pattern with native parallel execution. </div><div class="ttdef"><b>Definition:</b> native/divideconquer.h:124</div></div>
<div class="ttc" id="classgrppi_1_1parallel__execution__omp_html"><div class="ttname"><a href="classgrppi_1_1parallel__execution__omp.html">grppi::parallel_execution_omp</a></div><div class="ttdoc">OpenMP parallel execution policy. </div><div class="ttdef"><b>Definition:</b> parallel_execution_omp.h:40</div></div>
<div class="ttc" id="parallel__execution__omp_8h_html"><div class="ttname"><a href="parallel__execution__omp_8h.html">parallel_execution_omp.h</a></div></div>
<div class="ttc" id="classgrppi_1_1sequential__execution_html"><div class="ttname"><a href="classgrppi_1_1sequential__execution.html">grppi::sequential_execution</a></div><div class="ttdoc">Sequential execution policy. </div><div class="ttdef"><b>Definition:</b> sequential_execution.h:31</div></div>
<div class="ttc" id="namespacegrppi_html_ae820a6fafaefa61ab6db56187630638a"><div class="ttname"><a href="namespacegrppi.html#ae820a6fafaefa61ab6db56187630638a">grppi::internal_divide_conquer</a></div><div class="ttdeci">std::result_of&lt; Solver(Input)&gt;::type internal_divide_conquer(parallel_execution_native &amp;p, Input &amp;input, Divider &amp;&amp;divide_op, Solver &amp;&amp;solve_op, Combiner &amp;&amp;combine_op, std::atomic&lt; int &gt; &amp;num_threads)</div><div class="ttdef"><b>Definition:</b> native/divideconquer.h:33</div></div>
<div class="ttc" id="classgrppi_1_1parallel__execution__omp_html_ac46ceef1db7f46cc7c93a2e1f4a43f08"><div class="ttname"><a href="classgrppi_1_1parallel__execution__omp.html#ac46ceef1db7f46cc7c93a2e1f4a43f08">grppi::parallel_execution_omp::concurrency_degree</a></div><div class="ttdeci">int concurrency_degree() const noexcept</div><div class="ttdoc">Get number of grppi trheads. </div><div class="ttdef"><b>Definition:</b> parallel_execution_omp.h:85</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.11
</small></address>
</body>
</html>
